Graph Extremities Defined by Search Algorithms
نویسندگان
چکیده
منابع مشابه
Graph Extremities Defined by Search Algorithms
Graph search algorithms have exploited and in some cases identi ed graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called MLS and MLSM, each of which instantiates with parameters de ning the set of labels to be used, a partial order on l...
متن کاملSearch Algorithms for Conceptual Graph Databases
We consider a database composed of a set of conceptual graphs. Using conceptual graphs and graph homomorphism it is possible to build a basic query-answering mechanism based on semantic search. Graph homomorphism defines a partial order over conceptual graphs. Since graph homomorphism checking is an NP-Complete problem, the main requirement for database organizing and managing algorithms is to ...
متن کاملEfficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph ofhorizontal and vertical line segments. We first extract several basic operations for depth first search and breadth first search on a graph. Then we present data structures for the intersection graph in terms of which those operations can be implemented in an efficient man...
متن کاملDepth-First Search and Linear Graph Algorithms
The value of depth-first search or "bacltracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E dk for so...
متن کاملA General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic process called General Label Search (GLS), which uses a labeling structure which, when specified, defines specific algorithms. We characterize the vertex orderings computable by the basic types of searches in terms of prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2010
ISSN: 1999-4893
DOI: 10.3390/a3020100